Notes on Motion Estimation

نویسنده

  • David J. Heeger
چکیده

There are a great variety of applications that depend on analyzing the motion in image sequences. These include motion detection for surveillance, image sequence data compression (MPEG), image understanding (motion-based segmentation, depth/structure from motion), obstacle avoidance, image registration and compositing. The rst step in processing image sequences is typically image velocity estimation. The result is called the optical ow eld, a collection of two-dimensional velocity vectors, one for each small region (potentially, one for each pixel) of the image. Image velocities can be measured using correlation or block-matching (for example, see Anandan, 1989) in which each small patch of the image at one time is compared with nearby patches in the next frame. Feature extraction and matching is another way to measure the ow eld (for reviews of feature tracking methods see Barron, 1984, or Aggarwal and Nandhakumar, 1988). Gradient-based algorithms are a third approach to measuring ow elds (for example, Horn and Schunk, 1981; Lucas and Kanade, 1981; Nagel, 1987). A fourth approach using spatiotemporal ltering has also been proposed (for example, Watson and Ahumada, 1985; Heeger, 1987; Grzywacz and Yuille, 1990; Fleet and Jepson, 1990). This handout concentrates on the lter-based and gradient-based methods. Emphasis is placed on the importance of multiscale, coarse-tone, re nement of the velocity estimates. For a good overview and comparison of di erent ow methods, see (Barron et al, 1994).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Motion Vector Estimation Approach for Video Error Concealment Based on the Video Scene Analysis

In order to enhance the accuracy of the motion vector (MV) estimation and also reduce the error propagation issue during the estimation, in this paper, a new adaptive error concealment (EC) approach is proposed based on the information extracted from the video scene. In this regard, the motion information of the video scene around the degraded MB is first analyzed to estimate the motion type of...

متن کامل

New adaptive interpolation schemes for efficient meshbased motion estimation

Motion estimation and compensation is an essential part of existing video coding systems. The mesh-based motion estimation (MME) produces smoother motion field, better subjective quality (free from blocking artifacts), and higher peak signal-to-noise ratio (PSNR) in many cases, especially at low bitrate video communications, compared to the conventional block matching algorithm (BMA). Howev...

متن کامل

Some Notes on Factorization Methods for Projective Structure and Motion

We summarize the main known properties of factorization-based projective structure from motion, including the basic formulation, depth estimation and how it can sometimes be avoided, and some suggestions about statistical properties.

متن کامل

Adaptive search area for fast motion estimation

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...

متن کامل

Discontinuous Perturbation Analysis of Discrete-Event Dynamic Systems [Technical Notes and Correspon - Automatic Control, IEEE Transactions on

H. Lee, 2. Lin, and T. S. Huang, “Finding 3-D point correspondences in motion estimation,” in Proc. Eighth Int. Con$ Pattern Recognition, 1986, pp. 303-30.5. D. B. Goldgof, H. Lee, and T. S. Huang, “Matching and motion estimation of three dimensional point and line sets using eigenstructure without correspondences,” Pattern Recognition, vol. 25, no. 3, pp. 271-286, 1992. U. Helmke and J. B. Moo...

متن کامل

Wirelength Estimation based on Rent Exponents of Partitioning and Placement 1

Wirelength estimation is one of the most important Rent’s rule applications. Traditionally, the Rent exponent is extracted using recursive bipartitioning. However, the obtained exponent may not be appropriate for the purpose of wirelength estimation. In this paper, we propose the concepts of partitioning-based Rent exponent and placement-based Rent exponent. The relationship between these two e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002